Optimal Stochastic Switching under Convexity Assumptions
نویسنده
چکیده
Abstract. We address a method of approximate calculation of optimal control policy applicable to a particular class of stochastic control problems, whose stochastic dynamics exhibit a certain convexity preserving property. Problems of this type appear in many applications and encompass important examples arising in the area of optimal stopping and in the framework of control, based on partial observations. Utilizing this specific structure, we suggest a numerical method which enjoys a number of desirable properties. In particular, we work out a remarkably strong method for calculation of the value function: Within our numerically well-tractable approach, we show a convergence to the value function of the original problem uniformly on compact sets. This issue can be of great advantage, particularly for high-dimensional control problem, where the only competing methods from lest-squares Monte-Carlo family are able to serve merely L-convergence, under several restrictions. Since the presented algorithm is simple, stable and the procedures are dimensionindependent, the author hopes that it can help solving high dimensional control problems when other methods reach their computational limits.
منابع مشابه
Existence of an Optimal Control for Stochastic Control Systems with Nonlinear Cost Functional
We consider a stochastic control problem which is composed of a controlled stochastic differential equation, and whose associated cost functional is defined through a controlled backward stochastic differential equation. Under appropriate convexity assumptions on the coefficients of the forward and the backward equations we prove the existence of an optimal control on a suitable reference stoch...
متن کاملNon-convex dynamic programming and optimal investment
We establish the existence of minimizers in a rather general setting of dynamic stochastic optimization without assuming either convexity or coercivity of the objective function. We apply this to prove the existence of optimal portfolios for non-concave utility maximization problems in financial market models with frictions (such as illiquidity), a first result of its kind. The proofs are based...
متن کاملWeak Structural Dependence in Chance-Constrained Programming
In chance-constrained optimization problems, a solution is assumed to be feasible only with certain, sufficiently high probability. For computational and theoretical purposes, the convexity property of the resulting constraint set is treated. It is known, for example, that a suitable combination of a concavity property of the probability distribution and concavity of constraint mappings are suf...
متن کاملConvexity and Characterization of Optimal Policies in a Dynamic Routing Problem'
An infinite horizon, expected average cost, dynamic routing problem is formulated for a simple failure-prone queueing system, modelled as a continuous tithe, continuous state controlled stochastic process. We prove that the optimal average cost is independent of the initial state and that the cost-to-go functions of dynamic programming are convex. These results, together with a set of optimalit...
متن کاملOptimality of Deterministic Policies for Certain Stochastic Control Problems with Multiple Criteria and Constraints
For single-criterion stochastic control and sequential decision problems, optimal policies, if they exist, are typically nonrandomized. For problems with multiple criteria and constraints, optimal nonrandomized policies may not exist and, if optimal policies exist, they are typically randomized. In this paper we discuss certain conditions that lead to optimality of nonrandomized policies. In th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Control and Optimization
دوره 52 شماره
صفحات -
تاریخ انتشار 2014